Identification Conditions for the Solvability of NP-Complete Problems for the Class of Prefractal Graphs

Modern network systems (unmanned aerial vehicles groups, social networks, production chains, transport and logistics communication cryptocurrency networks) are distinguished by their multielement nature the dynamics of connections between elements. A number discrete problems on construction optimal substructures described in form various classes graphs NP-complete problems. In this case, variability dynamism structures lead to an additional complication search for solutions optimization At same time, some subclasses dynamic that used model system, conditions solvability a can be distinguished. This subclass includes prefractal graphs. article investigates graphs: Hamiltonian cycle, skeleton with maximum pendant vertices, monochromatic triangle, clique, independent set. The under which it is possible obtain answer about existence construct polynomial (when fixing seed vertices) algorithms finding identified.